No Easy Puzzles: A Hardness Result for Jigsaw Puzzles
نویسنده
چکیده
We show that solving jigsaw puzzles requires Θ(n ) edge matching comparisons, making them as hard as their trivial upper bound. This result generalises to puzzles of all shapes, and is applicable to both pictorial and apictorial puzzles.
منابع مشابه
Edge-Matching and Jigsaw Puzzles are Really Hard
We prove the computational intractability of rotating and placing n square tiles into a 1 × n array such that adjacent tiles are compatible—either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as in jigsaw puzzles. Beyond basic NP-hardness, we prove that it is NPhard even to approximately maximize the number of placed tiles (allowing blanks), while satisfying th...
متن کاملEven $1 \times n$ Edge-Matching and Jigsaw Puzzles are Really Hard
We prove the computational intractability of rotating and placing n square tiles into a 1×n array such that adjacent tiles are compatible—either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as in jigsaw puzzles. Beyond basic NP-hardness, we prove that it is NP-hard even to approximately maximize the number of placed tiles (allowing blanks), while satisfying the...
متن کاملJigsaw Puzzles As Cognitive Enrichment (PACE) - the effect of solving jigsaw puzzles on global visuospatial cognition in adults 50 years of age and older: study protocol for a randomized controlled trial
BACKGROUND Neurocognitive disorders are an important societal challenge and the need for early prevention is increasingly recognized. Meta-analyses show beneficial effects of cognitive activities on cognition. However, high financial costs, low intrinsic motivation, logistic challenges of group-based activities, or the need to operate digital devices prevent their widespread application in clin...
متن کاملHardness Amplification of Weakly Verifiable Puzzles
Is it harder to solve many puzzles than it is to solve just one? This question has different answers, depending on how you define puzzles. For the case of inverting one-way functions it was shown by Yao that solving many independent instances simultaneously is indeed harder than solving a single instance (cf. the transformation from weak to strong one-way functions). The known proofs of that re...
متن کاملA Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles: Final Report
For this project, I implemented the genetic algorithm-based jigsaw puzzle solver described in “A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles” by Sholomon et al [1]. This method involves producing a “child” solution from two “parent” solutions by detecting, extracting, and combining correctly assembled puzzle pieces. The solver developed by the paper’s team is able to accurately...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 586 شماره
صفحات -
تاریخ انتشار 2014